Approximate eigensolution of Laplacian matrices for locally modified graph products
نویسندگان
چکیده
منابع مشابه
Approximate graph products
The problem of recognizing approximate graph products arises in theoretical biology. This paper presents an algorithm that recognizes a large class of approximate graph products. The main part of this contribution is concerned with a new, local prime factorization algorithm that factorizes all strong products on an extensive class of graphs that contains, in particular, all products of triangle...
متن کاملPerformance Analysis of Graph Laplacian Matrices in Detecting Protein Complexes
Detecting protein complexes is an important way to discover the relationship between network topological structure and its functional features in protein-protein interaction (PPI) network. The spectral clustering method is a popular approach. However, how to select its optimal Laplacian matrix is still an open problem. Here, we analyzed the performances of three graph Laplacian matrices (unnorm...
متن کاملLaplacian Sum-Eccentricity Energy of a Graph
We introduce the Laplacian sum-eccentricity matrix LS_e} of a graph G, and its Laplacian sum-eccentricity energy LS_eE=sum_{i=1}^n |eta_i|, where eta_i=zeta_i-frac{2m}{n} and where zeta_1,zeta_2,ldots,zeta_n are the eigenvalues of LS_e}. Upper bounds for LS_eE are obtained. A graph is said to be twinenergetic if sum_{i=1}^n |eta_i|=sum_{i=1}^n |zeta_i|. Conditions ...
متن کاملLaplacian Energy of a Fuzzy Graph
A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...
متن کاملAlgorithms, Graph Theory, and Linear Equations in Laplacian Matrices
The Laplacian matrices of graphs are fundamental. In addition to facilitating the application of linear algebra to graph theory, they arise in many practical problems. In this talk we survey recent progress on the design of provably fast algorithms for solving linear equations in the Laplacian matrices of graphs. These algorithms motivate and rely upon fascinating primitives in graph theory, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2011
ISSN: 0377-0427
DOI: 10.1016/j.cam.2011.09.022